Medians of Discrete Sets according to a Linear Distance
نویسندگان
چکیده
منابع مشابه
Medians of Discrete Sets according to a Linear Distance
In this paper, we present some results concerning the median points of a discrete set according to a distance defined by means of two directions p and q. We describe a local characterization of the median points and show how these points can be determined from the projections of the discrete set along directions p and q. We prove that the discrete sets having some connectivity properties have a...
متن کاملDifferent-Distance Sets in a Graph
A set of vertices $S$ in a connected graph $G$ is a different-distance set if, for any vertex $w$ outside $S$, no two vertices in $S$ have the same distance to $w$.The lower and upper different-distance number of a graph are the order of a smallest, respectively largest, maximal different-distance set.We prove that a different-distance set induces either a special type of path or an independent...
متن کاملCenters and medians of distance-hereditary graphs
A graph is distance-hereditary if the distance between any two vertices in a connected induced subgraph is the same as in the original graph. In this paper, we study metric properties of distance-hereditary graphs. In particular, we determine the structures of centers and medians of distance-hereditary and related graphs. The relations between eccentricity, radius, and diameter of such graphs a...
متن کاملDiscrete Subsets of R 2 and the Associated Distance Sets
We prove that a well-distributed subset of R 2 can have a separated distance set only if the distance is induced by a polygon. Basic definitions Separated sets. We say that S ⊂ R d is separated if there exists c separation > 0 such that ||x − y|| ≥ c separation for every x, y ∈ S, x = y. Here and throughout the paper, ||x|| = x 2 1 + · · · + x 2 d is the standard Euclidean distance. Well-distri...
متن کاملK–Distance Sets, Falconer Conjecture, and Discrete Analogs
In this paper we prove a series of results on the size of distance sets corresponding to sets in the Euclidean space. These distances are generated by bounded convex sets and the results depend explicitly on the geometry of these sets. We also use a diophantine mechanism to convert continuous results into distance set estimates for discrete point sets.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2000
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s004540010018